Fast Approximate Matching Algorithm for Phone-based Keyword Spotting
نویسندگان
چکیده
Generally, exact matching is widely used for keyword spotting (KWS). Its performance depends heavily on the recognition accuracy. As for phone-based KWS system, the influence of phoneme error rate (PER) on KWS increases as the length of phoneme sequence for the keyword grows. Approximate matching is an alteration to compensate errors in recognition. Compared to exact matching, the calculation cost of approximate matching is extremely larger, limiting its application in KWS systems. In this paper, a fast approximate matching algorithm based on phone confusion network (PCN) is proposed. Given the keyword sequence, only paths with possible minimum edit distance are reserved during detection. Then others with larger edit distance are “generated” by detected ones. All paths are split into sub-paths during processing, which further reduces calculation cost effectively. Experimental results show that our algorithm is faster significantly than before optimization, with little performance degradation.
منابع مشابه
Fast implementation methods for Viterbi-based word-spotting
K. M. Knill S. J. Young Cambridge University Engineering Department, Cambridge, CB2 1PZ, UK ABSTRACT This paper explores methods of increasing the speed of a Viterbi-based word-spotting system for audio document retrieval. Fast processing is essential since the user expects to receive the results of a keyword search many times faster than the actual length of the speech. A number of computation...
متن کاملUnrestricted Vocabulary Keyword Spotting Using LSTM-CTC
Keyword spotting (KWS) aims to detect predefined keywords in continuous speech. Recently, direct deep learning approaches have been used for KWS and achieved great success. However, these approaches mostly assume fixed keyword vocabulary and require significant retraining efforts if new keywords are to be detected. For unrestricted vocabulary, HMM based keywordfiller framework is still the main...
متن کاملAUC Optimization Based Confidence Measure for Keyword Spotting
Confidence measure plays an important role in keyword spotting. To enhance the effectiveness of the confidence measure, we propose a novel method which improves the performance of keyword spotting by directly maximizing the area under the ROC curve (AUC). Firstly, we approximate the AUC as an objective function with the weighted mean confidence measure. Then, we optimize the objective function ...
متن کاملEstimation of Phone Mismatch Penalty Matricesfor Two-Stage Keyword Spotting
In this letter, we propose a novel approach to estimate three different kinds of phone mismatch penalty matrices for two-stage keyword spotting. When the output of a phone recognizer is given, detection of a specific keyword is carried out through text matching with the phone sequences provided by the specified keyword using the proposed phone mismatch penalty matrices. The penalty matrices ass...
متن کاملLexical Access-based Confidence Measure for a Spanish Keyword Spotting System
Keyword spotting deals with the search of a reduced set of keywords in audio content. Phone Lattice-based approaches are very fast but achieve poor results. HMM-based keyword spotting systems deal with filler models to absorb the Out-of-vocabulary (OOV) words and achieve best results although they are slower. We propose a technique which combines them in order to perform a confidence measure to...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- JNW
دوره 8 شماره
صفحات -
تاریخ انتشار 2013